A Note on the Complexity of the Recognition Problem for the Minimalist Grammars with Unbounded Scrambling and Barriers
نویسنده
چکیده
Minimalist Grammars were proposed recently as a model for the formal description of the natural-language syntax. This paper explores a nonlocal extension to this formalism that would make it possible to describe unbounded scrambling which is a discriptionally problematic syntactic phenomenon attested in many languages. It is shown that extending Minimalist Grammars with scrambling without shortest-move constraint (SMC) and with barriers makes the recognition problem for the resulting formalism NP-hard.
منابع مشابه
A NOTE ON THE ZIMMERMANN METHOD FOR SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS
There are several methods for solving fuzzy linear programming (FLP)problems. When the constraints and/or the objective function are fuzzy, the methodsproposed by Zimmermann, Verdegay, Chanas and Werners are used more often thanthe others. In the Zimmerman method (ZM) the main objective function cx is addedto the constraints as a fuzzy goal and the corresponding linear programming (LP)problem w...
متن کاملOn the Treatment of Scrambling and Adjunction in Minimalist Grammars
1 Introduction Stabler (2001:258) suggested that ""asymmetric" feature checking" is among the mechanisms that "remain to be carefully explored" within his "minimalist grammars" framework. Our presentation will undertake exactly this kind of exploration. Concretely, we are going to extend the "minimalist grammars" framework of Stabler (1997) (see also Harkema 2001; Michaelis 2001) by adding the ...
متن کاملOn the Treatment of Scrambling and Adjunction in Minimalist Grammars1
Stabler (2001:258) suggested that “‘asymmetric’ feature checking” is among the mechanisms that “remain to be carefully explored” within his “minimalist grammars” framework. Our paper will undertake exactly this kind of exploration. Concretely, we are going to extend the “minimalist grammars” framework of Stabler (1997) (see also Harkema 2001; Michaelis 2001) by adding the operations adjoin and ...
متن کاملA Note on Countercyclicity and Minimalist Grammars
Minimalist grammars (MGs), as introduced in Stabler (1997), have proven a useful instrument in the formal analysis of syntactic theories developed within the minimalist branch of the principles–and–parameters framework (cf. Chomsky 1995, 2000). In fact, as shown in Michaelis (2001), MGs belong to the class of mildly context–sensitive grammars. Interestingly, without there being a rise in (at le...
متن کاملThree Meta-heuristic Algorithms for the Single-item Capacitated Lot-sizing Problem (RESEARCH NOTE)
This paper proposes a mixed integer programming model for single-item capacitated lot-sizing problem with setup times, safety stock, demand shortages, outsourcing and inventory capacity. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA), vibration damping optimization (VDO) and harmony search (HS) have been used to solve this model. Additionally, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Procesamiento del Lenguaje Natural
دوره 39 شماره
صفحات -
تاریخ انتشار 2007